A deterministic approximation algorithm for the Densest k-Subgraph Problem
نویسندگان
چکیده
منابع مشابه
A Deterministic Approximation Algorithm for the Densest K-subgraph Problem
In the Densest k-Subgraph problem (DSP), we are given an undirected weighted graph G = (V, E) with n vertices (v1, ..., vn). We seek to find a subset of k vertices (k belonging to {1, ..., n}) which maximizes the number of edges which have their two endpoints in the subset. This problem is NP-hard even for bipartite graphs, and no polynomial-time algorithm with a fixed performance guarantee is ...
متن کاملDensest Subgraphs THE DENSE K SUBGRAPH PROBLEM
Given a graph G = (V, E) and a parameter k, we consider the problem of finding a subset U ⊆ V of size k that maximizes the number of induced edges (DkS). We improve upon the previously best known approximation ratio for DkS, a ratio that has not seen any progress during the last decade. Specifically, we improve the approximation ratio from n to n. The improved ratio is obtained by studying a va...
متن کاملDensest k-Subgraph Approximation on Intersection Graphs
We study approximation solutions for the densest k-subgraph problem (DS-k) on several classes of intersection graphs. We adopt the concept of σ-quasi elimination orders, introduced by Akcoglu et al. [?], generalizing the perfect elimination orders for chordal graphs, and develop a simple O(σ)-approximation technique for graphs admitting such a vertex order. This concept allows us to derive cons...
متن کاملOn the densest k-subgraph problem
Given an n-vertex graph G and a parameter k, we are to nd a k-vertex subgraph with the maximum number of edges. This problem is N P-hard. We show that the problem remains N P-hard even when the maximum degree in G is three. When G contains a k-clique, we give an algorithm that for any > 0 nds a k-vertex subgraph with at least (1 ?) ? k 2 edges, in time n O((1+log n k)==). We study the applicabi...
متن کاملExact and Approximation Algorithms for Densest k-Subgraph
The densest k-subgraph problem is a generalization of the maximum clique problem, in which we are given a graph G and a positive integer k, and we search among the subsets of k vertices of G one inducing a maximum number of edges. In this paper, we present algorithms for finding exact solutions of densest k-subgraph improving the standard exponential time complexity of O∗(2n) and using polynomi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Operational Research
سال: 2008
ISSN: 1745-7645,1745-7653
DOI: 10.1504/ijor.2008.017534